A Model Based on Dependency Relations
نویسنده
چکیده
E-transactions via shopping agents constitute a promising opportunity in the e-markets. In this article we will discuss the problem of contract negotiation in e-marketplaces. We succinctly present an overview of protocols commonly used to implement negotiation in e-markets. An analysis of the interaction process within e-markets according to different situation of individual and joint profit/cost is presented. We also present a case study of a marketplace for e-services using dependency relations within the negotiation process. The experimental results of this negotiation model show that a combination of utility functions and dependency relations increase the number of contacts and reduce the differences between agents’ individual profit. Finally, we conclude the article with the introduction of some potential research problems related to e-markets, which will be explored within future extensions of this work. IntroductIon The advancement in distributed and intelligent computing has facilitated the use of software agents for implementing e-services. Most electronic market places offer to their customer’s virtual agents that can do their bidding (i.e., eBay, onSale). E-transactions via shopping agents constitute a promising opportunity in the e-markets (Jennings, Faratin, Lomuscio, Parsons, Wooldridge, & Sierra, 2001; Chen, Vahidov, & Kersten, 2004). In fact, the software agents can be used in different stages of the e-business process: (i) attracting the customer, (ii) knowing how they buy, (iii) making transactions, (iv) perfecting orders, (v) giving effective customer service, (vi) offering customers recourse for problems such as breakage or returns, and (vii) providing a rapid conclusion such as electronic payment. In the distributed e-market paradigm, these functions are abstracted via agents representing both contractual parts. It becomes then critical to study and determine what kind of information and what Contract Negotiation in E-Marketplaces 1602 kinds of bargain policies need to be used both by agents and by the market place. Many researchers in intelligent agents’ domain have focused on the design of market architectures for electronic commerce (Fikes, Engelmore, Farquhar, & Pratt, 1995; Zwass, 1999; Schoop & Quix, 2001; Guan, 2002; Koning, 2002; Chiu, Cheung, & Till, 2003; Lamparter, Ankolekar, Studer, & Oberle, 2006; Ng, Chiu, & Hung, 2007), and on protocols governing the interaction of rational agents engaged in such transactions (Hogg & Jennings, 1997; Cheung, 2003; Kersten, 2005; Chiu, Cheung, Hung, Chiu, & Chung, 2005; Cheng, Hung, & Chiu, 2007; Neumann, Schnizler, Weber, & Weinhardt, 2007). New Web technologies such as ontologies and semantic Web are also becoming increasingly important components of e-marketplaces. In fact, ontologies provide machine-understandable semantics of data, which facilitate negotiation and automatic configuration of products and services. Many recent negotiation frameworks (Chiu, Poon, Lam, Tse, Sui, & Poon, 2005; Chiu, Cheung, Hung, & Leung, 2005; Chiu et al., 2005; Lee, Chiu, & Hung, 2006; Cheng et al., 2007) use ontology to facilitate matchmaking, recommendation, and negotiation. While providing support for direct agent interaction, most of existing architectures for multi-agents virtual markets usually lack explicit facilities for handling negotiation protocols, since they do not provide such protocols as an integrated part of the framework. In this article we will discuss the problem of contract negotiation in e-marketplaces. In the next section, we will present related models commonly used to implement negotiation in e-markets, game theory models, auction models, and contractnet protocols. The third section continues with interaction analysis by presenting the e-market bargaining process and identifying relevant types of dependency relationships between agents. It evaluates goal satisfaction under weak or strong dependency as well as the associated costs. The fourth section presents a case study of a marketplace for e-services where agents collaborate for the elaboration and provisioning of integrated services. We define the bargaining process that uses a negotiation protocol based on dependencies and a negotiation strategy based on risk evaluation. The fifth section presents some experimental analysis of the negotiation model implemented. The conclusion presented in the sixth section summarizes the article and paves the way for further research concerning the truth in the negotiation strategy and the use of temporal aspects on commitments and executions of contracts. contract negotIatIon Protocols For e-marKet Places The interaction between agents inside the marketplace is managed by a negotiation protocol. In fact, the negotiation protocol defines a set of public rules that allow agents to set up transaction contracts or co-operation agreements. Previous work and significant achievements are reported on various related fields of research and concrete solutions. Most of the Internet based market-places use auction protocols, especially the English auction. Hereafter, we present and evaluate some negotiation models developed either in some research works or implemented in some practical systems: game theory, auction models, contract-net protocols, and ontology-based negotiation.
منابع مشابه
Investigating Structural Relations Model of Cyber-Aggression Based on Perceived Stress with the Mediating Role of Virtual Networks Dependency in Students of Mohaghegh Ardabili University in 2019: A Descriptive Study
Background and Objectives: The use of virtual networks has become a natural modern behavior, but the traumatic forms of their use have also received much attention in the last two decades. This study aimed at modelling structural relations of cyber-aggression based on perceived stress with the mediating role of virtual networks dependency in students of Mohaghegh Ardabili University in 2019. M...
متن کاملAn annotation scheme for Persian based on Autonomous Phrases Theory and Universal Dependencies
A treebank is a corpus with linguistic annotations above the level of the parts of speech. During the first half of the present decade, three treebanks have been developed for Persian either originally or subsequently based on dependency grammar: Persian Treebank (PerTreeBank), Persian Syntactic Dependency Treebank, and Uppsala Persian Dependency Treebank (UPDT). The syntactic analysis of a sen...
متن کاملGeneralized Baum-Welch and Viterbi Algorithms Based on the Direct Dependency among Observations
The parameters of a Hidden Markov Model (HMM) are transition and emission probabilities‎. ‎Both can be estimated using the Baum-Welch algorithm‎. ‎The process of discovering the sequence of hidden states‎, ‎given the sequence of observations‎, ‎is performed by the Viterbi algorithm‎. ‎In both Baum-Welch and Viterbi algorithms‎, ‎it is assumed that...
متن کاملStructural Modeling Relations of Temperament and Character Mediated by Social Network Dependence with the Amount of Emotional Divorce of Women Referred to Counseling Centers in Babol
The purpose of the study was to model the relationship between the temperament characters with a dependency on social networks in Babol. The method of this study was a correlation with Structural Equation Modeling and covariance based approach. The statistical population included all women between 20 and 40 years of age who were in five counseling centers in collaboration with Babol Justice Div...
متن کاملEffect of Temperature Dependency on Thermoelastic Behavior of Rotating Variable Thickness FGM Cantilever Beam
Thermoelastic behavior of temperature-dependent (TD) and independent (TID) functionally graded variable thickness cantilever beam subjected to mechanical and thermal loadings is studied based on shear deformation theory using a semi-analytical method. Loading is composed of a transverse distributed force, a longitudinal distributed temperature field due to steady-state heat conduction from root...
متن کاملA generalization of Profile Hidden Markov Model (PHMM) using one-by-one dependency between sequences
The Profile Hidden Markov Model (PHMM) can be poor at capturing dependency between observations because of the statistical assumptions it makes. To overcome this limitation, the dependency between residues in a multiple sequence alignment (MSA) which is the representative of a PHMM can be combined with the PHMM. Based on the fact that sequences appearing in the final MSA are written based on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016